Proofs of Euclid I. 5
نویسندگان
چکیده
منابع مشابه
Proofs, pictures, and Euclid
Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With respect to the proofs in the Elements in particular, the received view is that Euclid’s reliance on geometric diagrams undermines his efforts to develop a gap-free deductive theory. The central difficulty concerns the g...
متن کاملAxiomatizing changing conceptions of the geometric continuuum I: Euclid-Hilbert
We begin with a general account of the goals of axiomatization, introducing several variants (e.g. modest) on Detlefsen’s notion of ‘complete descriptive axiomatization’. We examine the distinctions between the Greek and modern view of number, magnitude and proportion and consider how this impacts the interpretation of Hilbert’s axiomatization of geometry. We argue, as indeed did Hilbert, that ...
متن کاملFrom Euclid to Present: A Collection of Proofs regarding the Infinitude of Primes
Prime numbers are considered the basic building blocks of the counting numbers, and thus a natural question is: Are there infinitely many primes? Around 300BC, Euclid demonstrated, with a proof by contradiction, that infinitely many prime numbers exist. Since his work, the development of various fields of mathematics has produced subsequent proofs of the infinitude of primes. Each new and uniqu...
متن کاملComputational Euclid
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++ classes that efficiently supports the construction of complex geometric configurations. Although all computations are performed in floating-point arithmetic...
متن کاملEuclid ’ s Algorithm Andrzej
The main goal of the paper is to prove the correctness of the Euclid’s algorithm for SCM. We define the Euclid’s algorithm and describe the natural semantics of it. Eventually we prove that the Euclid’s algorithm computes the Euclid’s function. Let us observe that the Euclid’s function is defined as a function mapping finite partial states to finite partial states of SCM rather than pairs of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1902
ISSN: 0028-0836,1476-4687
DOI: 10.1038/065466a0